Two Encodings of DNNF Theories
نویسندگان
چکیده
The paper presents two new compilation schemes of Decomposable Negation Normal Form (DNNF) theories into Conjunctive Normal Form (CNF) and Linear Integer Programming (MIP), respectively. We prove that the encodings have useful properties such as unit propagation on the CNF formula achieves domain consistency on the DNNF theory. The approach is evaluated empirically on random as well as real-world CSP-problems.
منابع مشابه
On the tractable counting of theory models and its application to belief revision and truth maintenance
We introduced decomposable negation normal form (DNNF) recently as a tractable form of propositional theories, and provided a number of powerful logical operations that can be performed on it in polynomial time. We also presented an algorithm for compiling any conjunctive normal form (CNF) into DNNF and provided a structure-based guarantee on its space and time complexity. We present in this pa...
متن کاملCompiling Knowledge into Decomposable Negation Normal Form
We propose a method for compiling proposit ional theories into a new tractable form that we refer to as decomposable negation normal form (DNNF). We show a number of results about our compilation approach. First, we show that every propositional theory can be compiled into D N N F and present an algorithm to this effect. Second, we show that if a clausal form has a bounded treewidth, then its D...
متن کاملTableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. T...
متن کاملGrammatical Inference as a Satisfiability Modulo Theories Problem
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these for Moore and Mealy machines. Our experimental results show that these encodings improve upon the state-of-the-art, and are useful in practice for learning ...
متن کاملKnowledge Compilation: Decomposable Negation Normal Form versus Linkless Formulas
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008